Generating Functions for Inverted Semistandard Young Tableaux and Generalized Ballot Numbers
نویسنده
چکیده
An inverted semistandard Young tableau is a row-standard tableau along with a collection of inversion pairs that quantify how far the tableau is from being column semistandard. Such a tableau with precisely k inversion pairs is said to be a k-inverted semistandard Young tableau. Building upon earlier work by Fresse and the author, this paper develops generating functions for the numbers of kinverted semistandard Young tableaux of various shapes λ and contents μ. An easily-calculable generating function is given for the number of k-inverted semistandard Young tableaux that “standardize” to a fixed semistandard Young tableau. For m-row shapes λ and standard content μ, the total number of k-inverted standard Young tableaux of shape λ is then enumerated by relating such tableaux to m-dimensional generalizations of Dyck paths and counting the numbers of “returns to ground” in those paths. In the rectangular specialization of λ = nm this yields a generating function that involves m-dimensional analogues of the famed Ballot numbers. Our various results are then used to directly enumerate all k-inverted semistandard Young tableaux with arbitrary content and two-row shape λ = a1b1, as well as all k-inverted standard Young tableaux with two-column shape λ = 2n.
منابع مشابه
Inversions of Semistandard Young Tableaux
A tableau inversion is a pair of entries from the same column of a row-standard tableau that lack the relative ordering necessary to make the tableau columnstandard. An i-inverted Young tableau is a row-standard tableau with precisely i inversion pairs, and may be interpreted as a generalization of (column-standard) Young tableaux. Inverted Young tableaux that lack repeated entries were introdu...
متن کاملA 'Nice' Bijection for a Content Formula for Skew Semistandard Young Tableaux
Based on Schützenberger’s evacuation and a modification of jeu de taquin, we give a bijective proof of an identity connecting the generating function of reverse semistandard Young tableaux with bounded entries with the generating function of all semistandard Young tableaux. This solves Exercise 7.102 b of Richard Stanley’s book ‘Enumerative Combinatorics 2’.
متن کاملPlane Partitions
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular, we consider bounded plane partitions, symmetric plane partitions and weak reverse plane partitions. Using the combinatorial interpretations of Schur functions in relation to semistandard Young tableaux, we rely on the properties of symmetric functions. In our ...
متن کاملKirillov's Unimodality Conjecture for the Rectangular Narayana Polynomials
In the study of Kostka numbers and Catalan numbers, Kirillov posed a unimodality conjecture for the rectangular Narayana polynomials. We prove that the rectangular Narayana polynomials have only real zeros, and thereby confirm Kirillov’s unimodality conjecture. By using an equidistribution property between descent numbers and ascent numbers on ballot paths due to Sulanke and a bijection between...
متن کاملDual immaculate creation operators and a dendriform algebra structure on the quasisymmetric functions
The dual immaculate functions are a basis of the ring QSym of quasisymmetric functions, and form one of the most natural analogues of the Schur functions. The dual immaculate function corresponding to a composition is a weighted generating function for immaculate tableaux in the same way as a Schur function is for semistandard Young tableaux; an “immaculate tableau” is defined similarly to a se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 24 شماره
صفحات -
تاریخ انتشار 2017